Sparse approximate matrix-matrix multiplication for density matrix purification with error control

نویسندگان

چکیده

We propose an accelerated density matrix purification scheme with error control. The method makes use of the scale-and-fold acceleration technique and screening submatrix products in block-sparse matrix-matrix multiplies to reduce computational cost. An bound a parameter sweep are combined select threshold value for screening, such that can be controlled. evaluate performance comparison without product screening.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Highly Parallel Sparse Matrix-Matrix Multiplication

Generalized sparse matrix-matrix multiplication is a key primitive for many high performance graph algorithms as well as some linear solvers such as multigrid. We present the first parallel algorithms that achieve increasing speedups for an unbounded number of processors. Our algorithms are based on two-dimensional block distribution of sparse matrices where serial sections use a novel hyperspa...

متن کامل

Coded Sparse Matrix Multiplication

In a large-scale and distributed matrix multiplication problem C = AB, where C ∈ Rr×t, the coded computation plays an important role to effectively deal with “stragglers” (distributed computations that may get delayed due to few slow or faulty processors). However, existing coded schemes could destroy the significant sparsity that exists in large-scale machine learning problems, and could resul...

متن کامل

Block Algorithms for Sparse Matrix by Dense Matrix Multiplication

Sparse matrix computations appear in many linear algebra kernels of scienti c applications. The study, evaluation and optimization of sparse matrix codes is more complex than the dense case. Moreover, the irregularity of some memory accesses and the a-priory lack of knowledge of the number of iterations to be perfomed in some loops (both depending on the sparsity pettern) limit the succes of pr...

متن کامل

Sparse matrix multiplication package (SMMP)

Routines callable from FORTRAN and C are described which implement matrix–matrix multiplication and transposition for a variety of sparse matrix formats. Conversion routines between various formats are provided.

متن کامل

Sparse Matrix Multiplication Using UPC

Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide, they make distributing data and operating on ghost zones relatively easy. Meanwhile, they provide thread-data affinity that can enable locality exploitation. In this paper, we are considering sparse matrix multiplicatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Physics

سال: 2021

ISSN: ['1090-2716', '0021-9991']

DOI: https://doi.org/10.1016/j.jcp.2021.110354